Hamilton?connected {claw, bull}?free graphs
نویسندگان
چکیده
The generalized bull is the graph B i , j ${B}_{i,j}$ obtained by attaching endvertices of two disjoint paths lengths $i,j$ to vertices a triangle. We prove that every 3-connected { K 1 3 X } $\{{K}_{1,3},X\}$ -free graph, where ? 6 2 5 4 $X\in \{{B}_{1,6},{B}_{2,5},{B}_{3,4}\}$ Hamilton-connected. results are sharp and complete characterization forbidden induced bulls implying Hamilton-connectedness {claw, bull}-free graph.
منابع مشابه
The structure of bullfree graphs
The bull is a graph consisting of a triangle and two disjoint pendant edges. Obvious examples of bullfree graphs are graphs with no triangle, or graphs with no stable set of size three. But there are others (for examples substituting one bullfree graph into another produces another bullfree graphs). It turns out, however, that one can explicitly describe all bullfree graphs that cannon be const...
متن کاملClaw-free Graphs VI. Colouring Claw-free Graphs
In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number χ and clique number ω, then χ ≤ 2ω and the same for the complement of G. We also prove that the choice number of G is at most 2ω, except possibly in the case when G can be obtained from a subgraph of the Schläfli graph by replicating vertices. Finally, we show that th...
متن کاملEquimatchable Claw-Free Graphs
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable clawfree graph families. This characterization implies an efficient recognition algorithm.
متن کاملMinimal Claw-Free Graphs
A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G − e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs. MSC 2000: 05C75, 05C07
متن کاملClaw-free graphs. VII. Quasi-line graphs
A graph is a quasi-line graph if for every vertex v, the set of neighbours of v is expressible as the union of two cliques. Such graphs are more general than line graphs, but less general than claw-free graphs. Here we give a construction for all quasi-line graphs; it turns out that there are basically two kinds of connected quasi-line graphs, one a generalization of line graphs, and the other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22861